New self-dual additive F4-codes constructed from circulant graphs
نویسندگان
چکیده
In order to construct quantum [[n, 0, d]] codes for (n, d) = (56, 15), (57, 15), (58, 16), (63, 16), (67, 17), (70, 18), (71, 18), (79, 19), (83, 20), (87, 20), (89, 21), (95, 20), we construct self-dual additive F4-codes of length n and minimum weight d from circulant graphs. The quantum codes with these parameters are constructed for the first time.
منابع مشابه
Graph-based classification of self-dual additive codes over finite fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over ...
متن کاملNew extremal binary self-dual codes from F4+uF4-lifts of quadratic circulant codes over F4
In this work, quadratic double and quadratic bordered double circulant constructions are applied to F4 + uF4 as well as F4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and...
متن کاملDirected graph representation of half-rate additive codes over GF(4)
Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...
متن کاملAdditive codes over $GF(4)$ from circulant graphs
In 2006, Danielsen and Parker [8] proved that every self-dual additive code over GF (4) is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.
متن کاملFormally self-dual linear binary codes from circulant graphs
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So graph is an important tool for searching optimum code. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017